An efficient algorithm for reasoning over OWL EL ontologies with nominal schemas

Abstract Nominal schemas have been proposed as an extension to Description Logics (DL), the knowledge representation paradigm underlying Web Ontology Language (OWL). They provide for a very tight integration of DL and rules. can be understood syntactic sugar on top OWL. However, this naive perspective leads inefficient reasoning procedures. In order develop efficient procedure language ${\mathcal {E}\mathcal {L}\mathcal {V}^{++}}$, which results from extending OWL profile EL with nominal schemas, we propose transformation {V}^{++}}$ ontologies into Datalog-like rule programs that used satisfiability checking assertion retrieval. The use enables powerful Datalog engines solve tasks over ontologies. We implement then evaluate our approach several real-world, data-intensive ontologies, find it outperform state-of-the-art reasoners such Konclude ELK. As lesser side result also self-contained description rule-based algorithm {L}^{++}}$, does not require normal form transformation.